package Other.DP;

/**
 * @author:gao
 * @date:2020/7/11
 * @time:12:03
 * @version:0.0.1
 * @description:none
 */

//1143. 最长公共子序列
public class LongestCommonSubSequence {
}

class Solution234 {
    public int longestCommonSubsequence(String text1, String text2) {
        int len1 = text1.length();
        int len2 = text2.length();
        int[][] dp = new int[len1 + 1][len2 + 1];
        //为0的不使用 dp数组使用得都是从i+1 j+1开始
        for (int i = 0; i < len1; i++) {
            for (int j = 0; j < len2; j++) {
                if (text1.charAt(i) == text2.charAt(j)) {
                    dp[i + 1][j + 1] = dp[i][j] + 1;
                } else {
                    dp[i + 1][j + 1] = Math.max(Math.max(dp[i][j], dp[i][j + 1]), dp[i + 1][j]);
                }
            }
        }
        return dp[len1][len2];
    }

}
